-
1 sequencing axiom
-
2 sequencing axiom
Большой англо-русский и русско-английский словарь > sequencing axiom
-
3 sequencing axiom
Вычислительная техника: аксиома следования -
4 sequencing axiom
English-Russian dictionary of computer science and programming > sequencing axiom
-
5 sequencing axiom
-
6 axiom
- action precondition axiom
- axiom of assignment
- axiom of iteration
- axiom of selection
- frame axiom
- logical axiom
- negative effect axiom
- positive effect axiom
- practicability axiom
- reducibility axiom
- self-organization axiom
- sequencing axiom
- successor state axiom
- unique name axiomEnglish-Russian dictionary of computer science and programming > axiom
-
7 asynchronous sequencing
-
8 instruction sequencing
English-Russian dictionary of Information technology > instruction sequencing
-
9 аксиома следования
Большой англо-русский и русско-английский словарь > аксиома следования
См. также в других словарях:
Hoare logic — (also known as Floyd ndash;Hoare logic) is a formal system developed by the British computer scientist C. A. R. Hoare, and subsequently refined by Hoare and other researchers. The purpose of the system is to provide a set of logical rules in… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
Liste de problèmes np-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Embedding effect — The embedding effect is an issue in environmental economics.The effect suggests the contingent valuation method is not an unbiased approach to measuring policy impacts for cost benefit analysis of environmental, and other government, policies.… … Wikipedia
Algebra of Communicating Processes — The Algebra of Communicating Processes (ACP) is an algebraic approach to reasoning about concurrent systems. It is a member of the family of mathematical theories of concurrency known as process algebras or process calculi. ACP was initially… … Wikipedia
nature, philosophy of — Introduction the discipline that investigates substantive issues regarding the actual features of nature as a reality. The discussion here is divided into two parts: the philosophy of physics and the philosophy of biology. In this… … Universalium
Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… … Wikipedia
Semigroup — This article is about the algebraic structure. For applications to differential equations, see C0 semigroup. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup… … Wikipedia